Separability by two lines and by nearly straight polygonal chains

نویسندگان

  • Ferran Hurtado
  • Mercè Mora
  • Pedro Ramos
  • Carlos Seara
چکیده

In this paper we study the separability in the plane by two criteria: double-wedge separability and Θ-separability. We give an O(N logN)-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an O((N/Θ0) logN)-time algorithm for computing a nearly-straight minimal Θ-polygonal chain separating two sets of points, where Θ0 is a value which depends on the position of the points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separability by two lines and by flat polygonals∗

In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N logN)-time optimal algorithms for computing all the separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and the flattest minimal constant turn polygonal line separating two sets of points.

متن کامل

Special Issue: Discrete Geometry for Computer Imagery Supercover model, digital straight line recognition and curve reconstruction on the irregular isothetic grids

On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested in a discrete geometry on irregular grids. More precisely, our goal is to define geometrical properties on irregular isothetic grids that are tilings of the Euclidean plane with different sized axis parallel rectangles....

متن کامل

Straight Skeletons of Monotone Polygons

We study the characteristics of straight skeletons of strictly monotone polygonal chains, and use them to devise an algorithm for computing positively weighted straight skeletons of strictly monotone polygons. Our algorithm runs in O(n log n) time and O(n) space.

متن کامل

مطالعۀ تشریحی دو گونۀ تنگرس .Rhamnus cathartica L و .Rhamnus pallasii Fisch. & C.A.Mey از تیرۀ عنابیان در شمال ایران

Rhamnus L. is the genus of Rhamnaceae in Iran with nearly eight species. These species are used as valuable shrubs. This research was carried out in order to investigate the anatomical leaf. Samples from nine populations of Rhamnus pallasii and Rhamnus cathartica were taken. Treatment specimen cover various habitats from north of Iran, moreover herbarium samples were taken into account. The res...

متن کامل

Separating objects in the plane by wedges and strips

In this paper we study the separability of two disjoint sets of objects in the plane according to two criteria: wedge separability and strip separability. We give algorithms for computing all the separating wedges and strips, the wedges with the maximum and minimum angle, and the narrowest and the widest strip. The objects we consider are points, segments, polygons and circles. As applications,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 144  شماره 

صفحات  -

تاریخ انتشار 2004